#include<iostream>
using namespace std;
#include<vector>
string longestCommonPrefix(vector<string>& strs) {
    string s;
    int lengthStrs = strs.size();
    int min = 201;

    for (int i = 0; i < lengthStrs; i++)
    {
        if (min > strs[i].size())
        {
            min = strs[i].size();
        }
    }
    for (int i = 0; i < min; i++)
    {
        for (int j = 0; j < lengthStrs - 1; j++)
        {
            if (strs[j][i] != strs[j + 1][i])
                return s;
        }
        s += strs[0][i];
    }
    return s;
}
int main()
{
	return 0;
}